Matching Pursuit through Genetic Algorithms
نویسندگان
چکیده
Matching Pursuit is a greedy algorithm that decomposes any signal into a linear expansion of waveforms taken from a redundant dictionary. Computing the projection of the signal on every element of the basis has a high computational cost. To reduce this computational cost, optimized computational error minimization methods have to be found. Genetic Algorithms have shown to be a good tool to this approach.
منابع مشابه
Complementary Matching Pursuit Algorithms for Sparse Approximation
Sparse coding in a redundant basis is of considerable interest in many areas of signal processing. The problem generally involves solving an under-determined system of equations under a sparsity constraint. Except for the exhaustive combinatorial approach, there is no known method to find the exact solution for general dictionaries. Among the various algorithms that find approximate solutions, ...
متن کاملModified Orthogonal Matching Pursuit Algorithm for Cognitive Radio Wideband Spectrum Sensing
Sampling rate is the bottleneck for spectrum sensing over multi-GHz bandwidth. Recent progress in compressed sensing (CS) initialized several sub-Nyquist rate approaches to overcome the problem. However, efforts to design CS reconstruction algorithms for wideband spectrum sensing are very limited. It is possible to further reduce the sampling rate requirement and improve reconstruction performa...
متن کاملA Matching Pursuit Generalized Approximate Message Passing Algorithm
This paper proposes a novel matching pursuit generalized approximate message passing (MPGAMP) algorithm which explores the support of sparse representation coefficients step by step, and estimates the mean and variance of non-zero elements at each step based on a generalized-approximate-message-passing-like scheme. In contrast to the classic message passing based algorithms and matching pursuit...
متن کاملRandom Sampling of Sparse Trigonometric Polynomials, II. Orthogonal Matching Pursuit versus Basis Pursuit
We investigate the problem of reconstructing sparse multivariate trigonometric polynomials from few randomly taken samples by Basis Pursuit and greedy algorithms such as Orthogonal Matching Pursuit (OMP) and Thresholding. While recovery by Basis Pursuit has recently been studied by several authors, we provide theoretical results on the success probability of reconstruction via Thresholding and ...
متن کامل